Existential Import

نویسنده

  • Pieter A.M. Seuren
چکیده

The present paper deals with the semantics of all, some and not in English and related languages. Since these semantics imply a logic, it also deals with the logic of quantification in natural language. To the extent that the linguistic findings are universally valid, the results are relevant to the study of human cognition in general. Since standard quantification theory (SQT) replaced Aristotelian Predicate Calculus (APC), philosophers of language and semanticists have struggled with the fact that APC corresponds better with natural semantic intuitions than SQT. Pragmatics was called in to restore APC on non-logical, pragmatic grounds. The replacement of APC by SQT was motivated on the grounds that (a) APC suffers from improper existential import, and (b) SQT is a straightforward application of Boolean algebra, and as such preserves syllogistic reasoning on a mathematical basis. Logically speaking, SQT differs from APC in that the Aristotelian subaltern entailments are abolished, which makes the Aristotelian Square collapse but saves the equivalences (conversions) between ¬∀¬ and ∃, and ¬∃¬ and ∀. In SQT, the quantifying predicate ∃ over pairs of sets yields truth iff X ∩ Y ≠ Ø and ∀ does so iff X ⊆ Y. The author recently found that if the condition X ≠ Ø is added to the condition for ∀ and the conversions are changed into one-way entailments (i.e. ∀x(Fx,Gx) | – ¬∃x(Fx,¬Gx) and ∀x(Fx,¬Gx) | – ¬∃x(Fx,Gx), but not vice versa), APC is restored without improper existential import (only the subcontraries are lost). The Boolean basis is unaffected since whenever ∀ yields truth, it is still so that X ⊆ Y. The resulting revised Aristotelian predicate calculus (RAPC), is represented in the Hexagon of fig. 1 (arrows stand for entail-ments, 'C' for contraries, 'CD' for contradictories). Note that the tradi-of why the O-corner in APC is never lexicalised: there ís no O-corner to be lexicalized!) The revision of APC is easily shown by means of a valuation space interpretation (VSI) (Van Fraassen 1971). Let the valuation space (VS) of a sentence A, /A/, be the set of situations in a universe U of possible situations in which A is true. To say that A is true now amounts to saying that the actual situation s a ∈ /A/. Clearly, /¬A/ = U – /A/, /A ∧ B/ = /A/ ∩ /B/, and /A ∨ B/ = /A/ ∪ /B/, and the whole of standard …

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Existential Import in Cartesian Semantics

The paper explores the existential import of universal affirmative in Descartes, Arnauld and Malebranche. Descartes holds, inconsistently, that eternal truths are true even if the subject term is empty but that a proposition with a false idea as subject is false. Malebranche extends Descartes’ truthconditions for eternal truths, which lack existential import, to all knowledge, allowing only for...

متن کامل

Syllogistics = Monotonicity + Symmetry + Existential Import

Syllogistics reduces to only two rules of inference: monotonicity and symmetry, plus a third if one wants to take existential import into account. We give an implementation that uses only the monotonicity and symmetry rules, with an addendum for the treatment of existential import. Soundness follows from the monotonicity properties and symmetry properties of the Aristotelean quantifiers, while ...

متن کامل

What Does It Mean for an Indefinite to Be Presuppositional?

The paper is concerned with the nature of the presuppositionality involved in “strong” (or presuppositional) indefinite noun phrases in general, and Turkish accusative marked indefinites in particular. It investigates the semantics of Turkish accusative indefinites with regards to the categories of existential import, contextual restrictedness (or D-linking) and semantic scope, within the DRT-b...

متن کامل

Graal: A Toolkit for Query Answering with Existential Rules

This paper presents Graal, a java toolkit dedicated to ontological query answering in the framework of existential rules. We consider knowledge bases composed of data and an ontology expressed by existential rules. The main features of Graal are the following: a basic layer that provides generic interfaces to store and query various kinds of data, forward chaining and query rewriting algorithms...

متن کامل

Proving Existential Theorems when Importing Results from MDG to HOL

An existential theorem, for the specification or implementation of hardware, states that for any inputs there must exist at least one output which is consistent with it. It is proved to prevent an inconsistent model being produced and it is required to formally import the verification result from one verification system to another system. In this paper, we investigate the verification of the ex...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2002